Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements
نویسندگان
چکیده
منابع مشابه
A new condition for stable recovery of sparse signals from noisy measurements
The null space property and the restricted isometry property for a measurement matrix are two basic properties in compressive sampling, and are closely related to the sparse approximation. In this paper, we introduce the sparse approximation property of order s for a measurement matrix A: ‖xs‖2 ≤ D‖Ax‖2 + β σs(x) √ s for all x, where xs is the best s-sparse approximation of the vector x in `, σ...
متن کاملRecovery of Clustered Sparse Signals from Compressive Measurements
We introduce a new signal model, called (K,C)-sparse, to capture K-sparse signals in N dimensions whose nonzero coefficients are contained within at most C clusters, with C < K ≪ N . In contrast to the existing work in the sparse approximation and compressive sensing literature on block sparsity, no prior knowledge of the locations and sizes of the clusters is assumed. We prove that O (K + C lo...
متن کاملStochastic Recovery Of Sparse Signals From Random Measurements
Sparse signal recovery from a small number of random measurements is a well known NP-hard to solve combinatorial optimization problem, with important applications in signal and image processing. The standard approach to the sparse signal recovery problem is based on the basis pursuit method. This approach requires the solution of a large convex optimization problem, and therefore suffers from h...
متن کاملSparse Recovery from Saturated Measurements
A novel theory of sparse recovery is presented in order to bridge the standard compressive sensing framework and the one-bit compressive sensing framework. In the former setting, sparse vectors observed via few linear measurements can be reconstructed exactly. In the latter setting, the linear measurements are only available through their signs, so exact reconstruction of sparse vectors is repl...
متن کاملStable Recovery of Sparse Signals via $l_p-$Minimization
In this paper, we show that, under the assumption that ‖e‖2 ≤ ǫ, every k−sparse signal x ∈ R can be stably (ǫ 6= 0) or exactly recovered (ǫ = 0) from y = Ax+ e via lp−mnimization with p ∈ (0, p̄], where
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2011
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2011.2161470